منابع مشابه
Describing free groups
We consider countable free groups of different ranks. For these groups, we investigate computability theoretic complexity of index sets within the class of free groups and within the class of all groups. For a computable free group of infinite rank, we consider the difficulty of finding a basis.
متن کاملDescribing Groups
Two ways of describing a group are considered. 1. A group is finiteautomaton presentable if its elements can be represented by strings over a finite alphabet, in such a way that the set of representing strings and the group operation can be recognized by finite automata. 2. An infinite f.g. group is quasi-finitely axiomatizable if there is a description consisting of a single first-order senten...
متن کاملRandomizing and Describing Groups
In this work we study some topics in logic and group theory, and naturally, their intersection. One important theme in this work is the notion of random groups, which is informally the study of “what properties do ‘most’ groups satisfy?” In Chapter 2, we are interested in the theory of a random group, i.e., the properties we are interested here are first-order properties. Knight conjectured tha...
متن کاملCDMTCS Research Report Series Describing Groups
Two ways of describing a group are considered. 1. A group is finiteautomaton presentable if its elements can be represented by strings over a finite alphabet, in such a way that the set of representing strings and the group operation can be recognized by finite automata. 2. An infinite f.g. group is quasi-finitely axiomatizable if there is a description consisting of a single first-order senten...
متن کاملDescribing Syntax with Star-Free Regular Expressions
Syntactic constraints in Koskenniemi's Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turns out that although the constraints in Voutilainen's (1994) FSIG description of English make use of several extensions to regular expressions, the description as a whole reduces to a finite combination of union, compleme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2012
ISSN: 0002-9947,1088-6850
DOI: 10.1090/s0002-9947-2012-05456-0